Multi-item quick response system with budget constraint
نویسندگان
چکیده
منابع مشابه
Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملAn efficient multi-item dynamic auction with budget constrained bidders
An auctioneer wishes to sell several heterogeneous indivisible items to a group of potential bidders. Each bidder has valuations over the items but may face a budget constraint and therefore be unable to pay up to his values. In such markets, a Walrasian equilibrium may fail to exist. We develop a novel dynamic auction and prove that the auction always finds a core allocation. In the auction pr...
متن کاملMulti-Armed Bandit with Budget Constraint and Variable Costs
We study the multi-armed bandit problems with budget constraint and variable costs (MAB-BV). In this setting, pulling an arm will receive a random reward together with a random cost, and the objective of an algorithm is to pull a sequence of arms in order to maximize the expected total reward with the costs of pulling those arms complying with a budget constraint. This new setting models many I...
متن کاملA multiple-item budget-constraint newsboy problem with a reservation policy
In contrast to the classical newsboy-style problem, this paper develops a model for the multiple-item budget-constraint newsboy problem considering a reservation policy to meet marketing needs. A discount rate is provided to those customers who are willing to make a reservation. In addition to the demand from the original customers, extra demand is also included in the model due to the motivati...
متن کاملPrize-Collecting TSP with a Budget Constraint
We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2012
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.02.004